Computing Irreducible Representations of Supersolvable Groups
نویسندگان
چکیده
منابع مشابه
Computing Irreducible Representations of Supersolvable Groups
Recently, it has been shown that the ordinary irreducible representations of a supersolvable group G of order n given by a power-commutator presentation can be constructed in time 0(n2 log«). We present an improved algorithm with running time 0(n log/?).
متن کاملComputing irreducible representations of supersolvable groups over small finite fields
We present an algorithm to compute a full set of irreducible representations of a supersolvable group G over a finite field K, charK |G|, which is not assumed to be a splitting field of G. The main subroutines of our algorithm are a modification of the algorithm of Baum and Clausen (Math. Comp. 63 (1994), 351–359) to obtain information on algebraically conjugate representations, and an effectiv...
متن کاملComputing Irreducible Representations of Groups
How can you find a complete set of inequivalent irreducible (ordinary) representations of a finite group? The theory is classical but, except when the group was very small or had a rather special structure, the actual computations were prohibitive before the advent of high-speed computers ; and there remain practical difficulties even for groups of relatively small orders ( á 100). The present ...
متن کاملComputing Irreducible Representations of Finite Groups
We consider the bit-complexity of the problem stated in the title. Exact computations in algebraic number fields are performed symbolically. We present a polynomial-time algorithm to find a complete set of nonequivalent irreducible representations over the field of complex numbers of a finite group given by its multiplication table. In particular, it follows that some representative of each equ...
متن کاملAn Efficient Computer Program for the Symbolic Construction of Irreducible Representations of Supersolvable Groups
Baum and Clausen have presented in [1] an algorithm, refered to as BC-Algorithm, for the construction of a complete list of pairwise inequivalent ordinary irreducible representations for a given finite supersolvable group G. This algorithm is almost optimal in the sense that the running time is proportional to the length of the output up to some logarithmic factors. In this paper we describe an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1994
ISSN: 0025-5718
DOI: 10.2307/2153580